A New Load Sharing Algorithm based on Process Initiative

This paper presents a new load sharing method for distributed systems. We know that the global computing power is most of the time much underutilized in this kind of systems. Our goal is to share the load among the diierent processors. Usually, load sharing algorithms are based on the fact that information and decision of distribution are on the processor. We desire to give processes the ability to decide where they are going to run. This method is based on the independence and the initiative of entities. We aim to apply this theory to the distribution of the load on a network of workstations. We have written behavior algorithms for independent processes. We have also written a distributed system simulator and we have implemented our algorithm on it. The aim of this paper is to present our new method through the results obtained on the simulator.